Multiple-Reservoir Scheduling Using β-Hill Climbing Algorithm
نویسندگان
چکیده
منابع مشابه
Optimized Resource Selection to Promote Grid Scheduling Using Hill Climbing Algorithm
Grid computing is gaining ground in academia and commerce moving from scientific-based applications to service oriented problem solving environments. Grid is a distributed large-scale computing infrastructure providing dependable, secure, transparent, pervasive, inexpensive, and coordinated resource sharing. Resource selection and use are necessary to enhance application performance. Grid task ...
متن کاملTEM Color Image Segmentation using Hill Climbing Algorithm
TEM image is rapidly gaining prominence in various fields. Since high resolution TEM image captures huge amount of information, it is important to understand image segmentation techniques on it. The goal of image segmentation is to cluster pixels into salient image regions, i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. To have region based image retri...
متن کاملWhen a genetic algorithm outperforms hill-climbing
A toy optimisation problem is introduced which consists of a ÿtness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The hill-climber with a suuciently large neighbourhood outperforms the stochastic hill-climber, but i...
متن کاملPALO: A Probabilistic Hill-Climbing Algorithm
Many learning systems search through a space of possible performance elements, seeking an element whose expected utility, over the distribution of problems, is high. As the task of nding the globally optimal element is often intractable, many practical learning systems instead hill-climb to a local optimum. Unfortunately, even this is problematic as the learner typically does not know the under...
متن کاملBoolean Function Design Using Hill Climbing Methods
This paper outlines a general approach to the iterative incremental improvement of the cryptographic properties of arbitrary Boolean functions. These methods, which are known as hill climbing, offer a fast way to obtain Boolean functions that have properties superior to those of randomly generated functions. They provide a means to improve the attainable compromise between conflicting cryptogra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Systems
سال: 2019
ISSN: 2191-026X,0334-1860
DOI: 10.1515/jisys-2017-0159